Repeated-task Canadian Traveler Problem
نویسندگان
چکیده
منابع مشابه
Repeated-Task Canadian Traveler Problem
In the Canadian Traveler Problem (CTP) a traveling agent is given a weighted graph, where some of the edges may be blocked, with a known probability. The agent needs to travel to a given goal. A solution for CTP is a policy, that has the smallest expected traversal cost. CTP is intractable. Previous work has focused on the case of a single agent. We generalize CTP to a repeated task version whe...
متن کاملCanadian Traveler Problem with Remote Sensing
The Canadian Traveler Problem (CTP) is a navigation problem where a graph is initially known, but some edges may be blocked with a known probability. The task is to minimize travel effort of reaching the goal. We generalize CTP to allow for remote sensing actions, now requiring minimization of the sum of the travel cost and the remote sensing cost. Finding optimal policies for both versions is ...
متن کاملComplexity of Canadian traveler problem variants
The Canadian traveler problem (CTP) is the problem of traversing a given graph, where some of the edges may be blocked – a state which is revealed only upon reaching an incident vertex. Originally stated by Papadimitriou and Yannakakis (1991), the adversarial version of CTP was shown to be PSPACE-complete, with the stochastic version shown to be #P-hard. We show that stochastic CTP is also PSPA...
متن کاملTheoretical and Experimental Analysis of the Canadian Traveler Problem
Devising an optimal strategy for navigation in a partially observable environment is one of the key objectives in AI. One of the problem in this context is the Canadian Traveler Problem (CTP). CTP is a navigation problem where an agent is tasked to travel from source to target in a partially observable weighted graph, whose edge might be blocked with a certain probability and observing such blo...
متن کاملThe Canadian Traveller Problem Revisited
This study investigates a generalization of the Canadian Traveller Problem (CTP), which finds real applications in dynamic navigation systems used to avoid traffic congestion. Given a road network G = (V,E) in which there is a source s and a destination t in V , every edge e in E is associated with two possible distances: original d(e) and jam d(e). A traveller only finds out which one of the t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AI Communications
سال: 2015
ISSN: 1875-8452,0921-7126
DOI: 10.3233/aic-150665